import java.util.Scanner;

public class Work03 {
    public static void main(String[] args) {

        Scanner scan = new Scanner(System.in);
        //在此输入您的代码...
        int n = scan.nextInt();
        int[] arr = new int[n];
        int[] longest = new int[n];
        for(int i = 0;i<n;i++){

            for(int j = 0;j < n;j++){
                arr[j]++;
                if(j == i){
                    arr[i] = 0;
                }
                if(longest[j] < arr[j]){
                    longest[j] = arr[j];
                }
            }
        }
        for(int i = n-1;i>=0;i--){

            for(int j = 0;j < n;j++){
                arr[j]++;
                if(j == i){
                    arr[i] = 0;
                }
                if(longest[j] < arr[j]){
                    longest[j] = arr[j];
                }
            }
        }
        for(int i = 0; i < n/2; i++){
            longest[n-i-1] = longest[i];
        }
        for(int i = 0 ; i < n;i++){
            System.out.println(longest[i]);
        }
        scan.close();
    }
}
